全文获取类型
收费全文 | 1566篇 |
免费 | 524篇 |
国内免费 | 96篇 |
出版年
2024年 | 1篇 |
2023年 | 16篇 |
2022年 | 19篇 |
2021年 | 34篇 |
2020年 | 43篇 |
2019年 | 27篇 |
2018年 | 17篇 |
2017年 | 105篇 |
2016年 | 102篇 |
2015年 | 76篇 |
2014年 | 106篇 |
2013年 | 154篇 |
2012年 | 178篇 |
2011年 | 173篇 |
2010年 | 81篇 |
2009年 | 105篇 |
2008年 | 87篇 |
2007年 | 114篇 |
2006年 | 116篇 |
2005年 | 110篇 |
2004年 | 101篇 |
2003年 | 82篇 |
2002年 | 56篇 |
2001年 | 59篇 |
2000年 | 53篇 |
1999年 | 33篇 |
1998年 | 19篇 |
1997年 | 26篇 |
1996年 | 21篇 |
1995年 | 12篇 |
1994年 | 9篇 |
1993年 | 11篇 |
1992年 | 11篇 |
1991年 | 7篇 |
1990年 | 16篇 |
1989年 | 6篇 |
排序方式: 共有2186条查询结果,搜索用时 484 毫秒
51.
52.
53.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
54.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
55.
56.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
57.
MUSIC方法是空间谱估计中经典的子空间方法。提出了一种构造参考信号的预处理模型,提出了一种适合于MUSIC方法的多级维纳滤波结构。新方法避免了采样数据二阶统计的特征值分解,降低了运算量。仿真结果证明了方法的有效性。 相似文献
58.
设计了倾角较小的GEO导航星的广播星历拟合算法。该方法的核心思想是在常规拟合算法的基础上对位置观测量进行合理的坐标系参考平面旋转,特别是提出针对拟合迭代初值进行相应的坐标变换,从而既可以解决轨道参数拟合的相关性问题,使轨道参数拟合快速收敛,同时又兼顾了用户接收机的计算简便化。通过仿真验证,该方法简洁有效,拟合中误差RMS在厘米量级,能够保证拟合精度。 相似文献
59.
针对大规模数据集的分类问题,支持向量机的训练成为一个难题。增量学习是解决这一难题的思路之一。分析了新增样本加入训练集后支持向量集的变化情况,提出了一种基于密度法的支持向量机增量学习淘汰算法,淘汰了对最终分类无用的样本,在保证测试精度的同时减少了训练时间。实验仿真证明这种算法是有效的。 相似文献
60.